From 1e554737ac3fda9ecf16c4a2818598b6032d7390 Mon Sep 17 00:00:00 2001
From: omagdy7 <omar.professional8777@gmail.com>
Date: Tue, 26 Sep 2023 14:32:40 +0300
Subject: Solved A and B in the last Div2

---
 contests/Round899/B/] | 177 ++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 177 insertions(+)
 create mode 100644 contests/Round899/B/]

(limited to 'contests/Round899/B/]')

diff --git a/contests/Round899/B/] b/contests/Round899/B/]
new file mode 100644
index 0000000..b2b3325
--- /dev/null
+++ b/contests/Round899/B/]
@@ -0,0 +1,177 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pii = pair<int, int>;
+using vpi = vector<pii>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+#define make_unique(x)                                                         \
+  sort(all((x)));                                                              \
+  (x).resize(unique(all((x))) - (x).begin())
+#define ceil(a, b) ((a) + (b)-1) / (b)
+
+const int MOD = (int)1e9 + 7;
+const db PI = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const pair<K, V> &p);
+template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec);
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const map<K, V> &m);
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const unordered_map<K, V> &m);
+template <typename T> ostream &operator<<(ostream &os, const set<T> &s);
+template <typename T>
+ostream &operator<<(ostream &os, const unordered_set<T> &s);
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const pair<K, V> &p) {
+  os << "(" << p.first << ", " << p.second << ")";
+  return os;
+}
+
+template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
+  os << "{";
+  for (size_t i = 0; i < vec.size(); ++i) {
+    if (i > 0)
+      os << ", ";
+    os << vec[i];
+  }
+  os << "}";
+  return os;
+}
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const map<K, V> &m) {
+  os << "{";
+  for (const auto &p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template <typename K, typename V>
+ostream &operator<<(ostream &os, const unordered_map<K, V> &m) {
+  os << "{";
+  for (const auto &p : m) {
+    os << p.first << ": " << p.second << ", ";
+  }
+  os << "}";
+  return os;
+}
+
+template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
+  int i = 0;
+  os << "{";
+  for (const auto &e : s) {
+    if (i > 0)
+      os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+template <typename T>
+ostream &operator<<(ostream &os, const unordered_set<T> &s) {
+  int i = 0;
+  os << "{";
+  for (const auto &e : s) {
+    if (i > 0)
+      os << ", ";
+    os << e;
+    i++;
+  }
+  os << "}";
+  return os;
+}
+
+void dbg() { cerr << "\n"; }
+
+template <typename T, typename... TS> void dbg(T val, TS... vals) {
+  cerr << val << " ";
+  dbg(vals...);
+}
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
+
+void solve() {
+  int n;
+  cin >> n;
+  vector<vi> v(n);
+  map<int, int> fq;
+  map<int, vi> mp;
+  set<int> S;
+  int mx = 0;
+  for (int i = 0; i < n; i++) {
+    int s;
+    cin >> s;
+    for (int j = 0; j < s; j++) {
+      int x;
+      cin >> x;
+      fq[x]++;
+      mp[x].pb(i);
+      S.insert(x);
+      v[i].pb(x);
+    }
+  }
+  for (auto ele : S) {
+    dbg("ele:", ele);
+    int cnt = 0;
+    map<int, int> fq_tmp = fq;
+    for (auto x : mp[ele]) {
+      dbg("mp[ele]: ", mp[ele]);
+      dbg("v[x]", v[x]);
+      for (auto xx : v[x]) {
+        fq_tmp[xx]--;
+      }
+    }
+    for (auto x : mp[ele]) {
+      dbg("mp[ele]: ", mp[ele]);
+      dbg("v[x]", v[x]);
+      for (auto xx : v[x]) {
+        cnt += (fq_tmp[xx] == 0);
+      }
+    }
+    if (cnt > 0) {
+      mx = max(mx, (int)S.size() - cnt);
+    }
+  }
+  dbg("---------------");
+  /* dbg(mx); */
+  cout << mx << '\n';
+  /* dbg("S:", S); */
+  /* dbg(mp); */
+  /* dbg(v); */
+}
+
+int main() {
+  ios_base::sync_with_stdio(false);
+  cin.tie(NULL);
+  int tt;
+  cin >> tt;
+  while (tt--) {
+    solve();
+  }
+}
-- 
cgit v1.2.3